Data Cleaning by Ihab F. Ilyas and Xu Chu

Author:Ihab F. Ilyas and Xu Chu
Language: eng
Format: epub
Publisher: Association for Computing Machinery

Figure 5.1 TANE.

Algorithm 5.1TANE

Input: One relational instance I, schema R

Output: All minimal FDs Σ

L1 ←{{A}|A ∈attr(R)}

l ←1

while Ll = do

forall Node Y ∈ Ll do

forall Parent node X of Y do

if X →Y − X is valid then

add X →Y − X to Σ

endif

endfor

endfor

pruning Ll based on the three pruning rules

Ll+1 ← generate next level based on Ll

l ←l +1

endwhile

Algorithm 5.2FASTFD

Input: One relational instance I, schema R

Output: All minimal FDs Σ

forall A ∈attr(R) do

calculate

endfor

forall A ∈attr(R) do

Finding all minimal set covers of using a depth-first search

For every cover X, add X → A to Σ

endfor

Download

Copyright Disclaimer:
This site does not store any files on its server. We only index and link to content provided by other sites. Please contact the content providers to delete copyright contents if any and email us, we'll remove relevant links or contents immediately.